associative array

A data structure that carries out a mathematical calculation on a field identifier to determine where a data element in a large table or index is located.
صفيف مقترن

English-Arabic terms dictionary. 2015.

Look at other dictionaries:

  • Associative array — In computer science, an associative array (also called a map or a dictionary) is an abstract data type composed of a collection of (key,value) pairs, such that each possible key appears at most once in the collection. Operations associated with… …   Wikipedia

  • associative array — noun One of a number of array like data structures where the indices (called ) are not limited to integers …   Wiktionary

  • Array data type — Not to be confused with Array data structure. In computer science, an array type is a data type that is meant to describe a collection of elements (values or variables), each selected by one or more indices that can be computed at run time by the …   Wikipedia

  • Array — In computer science an array [Paul E. Black, array , in Dictionary of Algorithms and Data Structures , Paul E. Black, ed., U.S. National Institute of Standards and Technology. 26 August 2008 (accessed 10 September 2008).… …   Wikipedia

  • Comparison of programming languages (array) — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations …   Wikipedia

  • Dynamic array — Several values are inserted at the end of a dynamic array using geometric expansion. Grey cells indicate space reserved for expansion. Most insertions are fast (constant time), while some are slow due to the need for reallocation (Θ(n) time,… …   Wikipedia

  • Judy array — In computer science and software engineering, a Judy array is a complex but very fast associative array data structure for storing and looking up values using integer or string keys. Unlike arrays, Judy arrays may be sparse; that is, they may… …   Wikipedia

  • Hash array mapped trie — A hash array mapped trie [Bagwell, P. (2001) [http://lampwww.epfl.ch/papers/idealhashtrees.pdf Ideal Hash Trees] . Technical Report, 2001.] (HAMT) is an implementation of an associative array that combines the characteristics of a hash table and… …   Wikipedia

  • Table associative — Tableau associatif En informatique, un tableau associatif (aussi appelé dictionnaire ou table d association) est un type de données associant à un ensemble de clefs un ensemble correspondant de valeurs. Ces ensembles sont bien entendu finis.… …   Wikipédia en Français

  • Comparison of programming languages (mapping) — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations …   Wikipedia

  • Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.